Limits for embedding distributions

نویسندگان

چکیده

In this paper, we first establish a version of the central limit theorem for double sequence {pi(n)} that satisfies linear recurrence relation. Then find and prove under some commonly observed conditions, embedding distributions an H-linear family graphs with spiders is asymptotic to normal distribution. Applications are given well-known path-like ring-like sequences graphs. We also Euler-genus same as crosscap-number sequence.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hilbert Space Embedding for Distributions

We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a reproducing kernel Hilbert space. Applications of this technique can be found in two-sample tests, which are used for determining whether two sets of observations arise from the same distribution, covariate shift correction,...

متن کامل

Embedding Distributions and Chebyshev Polynomials

The history of genus distributions began with J. Gross et al. in 1980s. Since then, a lot of study has given to this parameter, and the explicit formulas are obtained for various kinds of graphs. In this paper, we find a new usage of Chebyshev polynomials in the study of genus distribution, using the overlap matrix, we obtain homogeneous recurrence relation for rank distribution polynomial, whi...

متن کامل

Summarization Based on Embedding Distributions

In this study, we consider a summarization method using the document level similarity based on embeddings, or distributed representations of words, where we assume that an embedding of each word can represent its “meaning.” We formalize our task as the problem of maximizing a submodular function defined by the negative summation of the nearest neighbors’ distances on embedding distributions, ea...

متن کامل

Binary Embedding: Fundamental Limits and Fast Algorithm

Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary N distinct points in S, our goal is to encode each point using mdimensional binary strings such that we can reconstruct their geodesic distance up to δ uniform distortion. Existing bina...

متن کامل

Entropic Graph Embedding via Multivariate Degree Distributions

Although there are many existing alternative methods for using structural characterizations of undirected graphs for embedding, clustering and classification problems, there is relatively little literature aimed at dealing with such problems for directed graphs. In this paper we present a novel method for characterizing graph structure that can be used to embed directed graphs into a feature sp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2021

ISSN: ['1090-2074', '0196-8858']

DOI: https://doi.org/10.1016/j.aam.2021.102175